Putnam and Constructibility *

نویسنده

  • Luca Bellotti
چکیده

I discuss and try to evaluate the argument about constructible sets made by Putnam in “Models and Reality”, and some of the counterarguments directed against it in the literature. I shall conclude that Putnam’s argument, while correct in substance, nevertheless has no direct bearing on the philosophical question of unintended models of set theory. MSC2000: 00A30, 03A05, 03E45.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nominalism and the application of mathematics

A significant feature of contemporary science is the widespread use of mathematics in several of its subfields. In many instances, the content of scientific theories cannot be formulated without reference to mathematical objects (such as functions, numbers, or sets). In the hands of W. V. Quine and Hilary Putnam, this feature of scientific practice was invoked in support of platonism (the view ...

متن کامل

A New Proof for the Monte Carlo Constructibility of Log Log N

The Monte Carlo constructibility of log logn has proved by Karpinski and Verbeek ([KV87]). They proposed an algorithm, and proved the constructibility by applying a statistical result in [Fel57] to the algorithm. We give a new algorithm, and prove the constructibility by analyzing the algorithm.

متن کامل

Automated Rebar Constructibility Problems Diagnosis: a Concept-proving Prototype

The paper describes a rebar constructibility model, which was developed in an object-oriented graphic environment. The model is intended to be used during the design phase to automatically diagnose potential rebar-related constructibility problems (the Diagnosis Module), as well as to offer solutions and implement them (the Correction Module). The Diagnosis Module was implemented first in a con...

متن کامل

Constructibility of speed one signal on cellular automata

This paper studies the capabilities of one dimensional, neighborhood of radius one cellular automata to construct speed one signals. We de/ne the notions of constructibility, consistent constructibility and preserving complexity consistent constructibility. Our main results are the following. • There exists a one dimensional neighborhood of radius one cellular automaton with four states which p...

متن کامل

BOUNDED m-ARY PATCH-WIDTH ARE EQUIVALENT FOR m ≥ 3

We consider the notion of bounded m-ary patch-width defined in [4], and its very close relative m-constructibility defined below. We show that the notions of m-constructibility all coincide for m ≥ 3, while 1-constructibility is a weaker notion. The same holds for bounded m-ary patch-width. The case m = 2 is left open.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004